Probabilistic harmonization with fixed intermediate chord constraints
نویسندگان
چکیده
During the last decades, several methodologies have been proposed for the harmonization of a given melody with algorithmic means. Among the most successful are methodologies that incorporate probabilistic mechanisms and statistical learning, since they have the ability to generate harmonies that statistically adhere to the harmonic characteristics of the idiom that the training pieces belong to. The current paper discusses the utilization of a well–studied probabilisticmethodology, the hiddenMarkovmodel (HMM), in combination with additional constraints that incorporate intermediate fixed–chord constraints. This work is motivated by the fact that some parts of a phrase (like the cadence) or a piece (e.g. points of modulation, peaks of tension, intermediate cadences etc.) are characteristic about the phrase’s or piece’s idiomatic identity. The presented methodology allows to define and isolate such important parts/functions and include them as constraints in a probabilistic harmonization methodology. To this end, the constrained HMM (CHMM) is developed, harnessed with the novel general chord type (GCT) representation, while the study focuses on examples that highlight the diversity that constraints introduce in harmonizations.
منابع مشابه
Probabilistic Melodic Harmonization
We propose a representation for musical chords that allows us to include domain knowledge in probabilistic models. We then introduce a graphical model for harmonization of melodies that considers every structural components in chord notation. We show empirically that root notes progressions exhibit global dependencies that can be better captured with a tree structure related to the meter than w...
متن کاملFunction- and Rhythm-Aware Melody Harmonization Based on Tree-Structured Parsing and Split-Merge Sampling of Chord Sequences
This paper presents an automatic harmonization method that, for a given melody (sequence of musical notes), generates a sequence of chord symbols in the style of existing data. A typical way is to use hidden Markov models (HMMs) that represent chord transitions on a regular grid (e.g., bar or beat grid). This approach, however, cannot explicitly describe the rhythms, harmonic functions (e.g., t...
متن کاملSupport vector regression with random output variable and probabilistic constraints
Support Vector Regression (SVR) solves regression problems based on the concept of Support Vector Machine (SVM). In this paper, a new model of SVR with probabilistic constraints is proposed that any of output data and bias are considered the random variables with uniform probability functions. Using the new proposed method, the optimal hyperplane regression can be obtained by solving a quadrati...
متن کاملCommon Fixed Point Theory in Modified Intuitionistic Probabilistic Metric Spaces with Common Property (E.A.)
In this paper, we define the concepts of modified intuitionistic probabilistic metric spaces, the property (E.A.) and the common property (E.A.) in modified intuitionistic probabilistic metric spaces.Then, by the commonproperty (E.A.), we prove some common fixed point theorems in modified intuitionistic Menger probabilistic metric spaces satisfying an implicit relation.
متن کاملChorale Harmonization with Weighted Finite-state Transducers
We approach the task of harmonizing chorales through style imitation by probabilistically modelling the harmony of music pieces in the framework of weighted finite-state transducers (WFSTs), which have been used successfully for probabilistic models in speech and language processing. The framework makes it possible to place domain-specific regular constraints on generated sequences, and to inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014